Two Legendre-Dual-Petrov-Galerkin Algorithms for Solving the Integrated Forms of High Odd-Order Boundary Value Problems

Two numerical algorithms based on dual-Petrov-Galerkin method are developed for solving the integrated forms of high odd-order boundary value problems (BVPs) governed by homogeneous and nonhomogeneous boundary conditions. Two different choices of trial functions and test functions which satisfy the underlying boundary conditions of the differential equations and the dual boundary conditions are used for this purpose. These choices lead to linear systems with specially structured matrices that can be efficiently inverted, hence greatly reducing the cost. The various matrix systems resulting from these discretizations are carefully investigated, especially their complexities and their condition numbers. Numerical results are given to illustrate the efficiency of the proposed algorithms, and some comparisons with some other methods are made

Shifted Jacobi spectral collocation method with convergence analysis for solving integro-differential equations and system of integro-differential equations

This article addresses the solution of multi-dimensional integro-differential equations (IDEs) by means of the spectral collocation method and taking the advantage of the properties of shifted Jacobi polynomials. The applicability and accuracy of the present technique have been examined by the given numerical examples in this paper. By means of these numerical examples, we ensure that the present technique is simple and very accurate. Furthermore, an error analysis is performed to verify the correctness and feasibility of the proposed method when solving IDE

Approximate solutions for solving nonlinear variable-order fractional Riccati differential equations

In this manuscript, we introduce a spectral technique for approximating the variable-order fractional Riccati equation (VO-FRDEs). Firstly, the solution and its space fractional derivatives is expanded as shifted Chebyshev polynomials series. Then we determine the expansion coefficients by reducing the VO-FRDEs and its conditions to a system of algebraic equations. We show the accuracy and applicability of our numerical approach through four numerical examples. &nbsp

Jacobi rational-Gauss collocation method for Lane-Emden equations of astrophysical significance

In this paper, a new spectral collocation method is applied to solve Lane-Emden equations on a semi-infinite domain. The method allows us to overcome difficulty in both the nonlinearity and the singularity inherent in such problems. This Jacobi rational-Gauss method, based on Jacobi rational functions and Gauss quadrature integration, is implemented for the nonlinear Lane-Emden equation. Once we have developed the method, numerical results are provided to demonstrate the method. Physically interesting examples include Lane-Emden equations of both first and second kind. In the examples given, by selecting relatively few Jacobi rational-Gauss collocation points, we are able to get very accurate approximations, and we are thus able to demonstrate the utility of our approach over other analytical or numerical methods. In this way, the numerical examples provided demonstrate the accuracy, efficiency, and versatility of the method

New recursive approximations for variable-order fractional operators with applications

To broaden the range of applicability of variable-order fractional differential models, reliable numerical approaches are needed to solve the model equation.In this paper, we develop Laguerre spectral collocation methods for solving variable-order fractional initial value problems on the half line. Specifically, we derive three-term recurrence relations to efficiently calculate the variable-order fractional integrals and derivatives of the modified generalized Laguerre polynomials, which lead to the corresponding fractional differentiation matrices that will be used to construct the collocation methods. Comparison with other existing methods shows the superior accuracy of the proposed spectral collocation methods

Efficient algorithms for construction of recurrence relations for the expansion and connection coefficients in series of quantum classical orthogonal polynomials

Formulae expressing explicitly the q-difference derivatives and the moments of the polynomials Pn(x ; q) ∈ T (T ={Pn(x ; q) ∈ Askey–Wilson polynomials: Al-Salam-Carlitz I, Discrete q-Hermite I, Little (Big) q-Laguerre, Little (Big) q-Jacobi, q-Hahn, Alternative q-Charlier) of any degree and for any order in terms of Pi(x ; q) themselves are proved. We will also provide two other interesting formulae to expand the coefficients of general-order q-difference derivatives Dqpf(x), and for the moments xℓDqpf(x), of an arbitrary function f(x) in terms of its original expansion coefficients. We used the underlying formulae to relate the coefficients of two different polynomial systems of basic hypergeometric orthogonal polynomials, belonging to the Askey–Wilson polynomials and Pn(x ; q) ∈ T. These formulae are useful in setting up the algebraic systems in the unknown coefficients, when applying the spectral methods for solving q-difference equations of any order

Two legendre-dual-Petrov-Galerkin algorithms for Solving the integrated forms of high odd-order boundary value problems

Two numerical algorithms based on dual-Petrov-Galerkin method are developed for solving the integrated forms of high odd-order boundary value problems (BVPs) governed by homogeneous and nonhomogeneous boundary conditions. Two different choices of trial functions and test functions which satisfy the underlying boundary conditions of the differential equations and the dual boundary conditions are used for this purpose. These choices lead to linear systems with specially structured matrices that can be efficiently inverted, hence greatly reducing the cost. The various matrix systems resulting from these discretizations are carefully investigated, especially their complexities and their condition numbers. Numerical results are given to illustrate the efficiency of the proposed algorithms, and some comparisons with some other methods are made

Integral spectral Tchebyshev approach for solving space Riemann-Liouville and Riesz fractional advection-dispersion problems

Abstract The principal aim of this paper is to analyze and implement two numerical algorithms for solving two kinds of space fractional linear advection-dispersion problems. The proposed numerical solutions are spectral and they are built on assuming the approximate solutions to be certain double shifted Tchebyshev basis. The two typical collocation and Petrov-Galerkin spectral methods are applied to obtain the desired numerical solutions. The special feature of the two proposed methods is that their applications enable one to reduce, through integration, the fractional problem under investigation into linear systems of algebraic equations, which can be efficiently solved via any suitable solver. The convergence and error analysis of the double shifted Tchebyshev basis are carefully investigated, aiming to illustrate the correctness and feasibility of the proposed double expansion. Finally, the efficiency, applicability, and high accuracy of the suggested algorithms are demonstrated by presenting some numerical examples accompanied with comparisons with some other existing techniques discussed in the literature